Estimation and Control of an Automated Guided Vehicle

نویسندگان

  • Suthep Butdee
  • Frederic Vignat
  • Anan Suebsomran
چکیده

In this paper a control strategy of Automated Guided Vehicle (AGV) is proposed. The vehicle movement controlled by an inboard PLC do not need physical guide. The vehicle has 3 wheels. The front wheel is used for steering and driving. The 2 rear wheels are free and equipped with 2 encoders. The strategy is based on 2 main purposes: the path is stored in the PLC memory and the vehicle displacement is calculated form the wheel rotation measurement. The comparison between the required path and the actual position of the AGV allow calculating deviation error. Function of this error, a correction strategy of driving speed and steering angle is applied in order to get a smooth and precise displacement. Mobile vehicles must know its position and orientation in order to movement to reach the goals precisely. We describe localization techniques for AGV that is based on the principle of Kalman Filtering (KF) algorithm estimation. This paper also addresses the problems of factory navigation and modelling with focus on keeping automatic travelling along the control path of the AGV. Position and orientation is measured by using encoder sensor on driving and steering axes. The control and localization systems are developed. Reference path and observation measurement are matched. To keep track of the matching result of both positions, the estimated position information used to update the vehicle’s position by using the Kalman Filtering (KF) algorithm. Test performance is verified with accurate positioning control by simulation and experimentation. Keyword: Automated Guided Vehicle (AGV), Controlled Path, Kalman Filter Estimator, PID controller

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AGV (automated guided vehicle) robot: Mission and obstacles in design and performance

The AGV (automated guided vehicle) was introduced in UK in 1953 for transporting. But nowadays, due to their high efficiency, flexibility, reliability, safety and system scalability, they are used in various application in industries. In brief, the AGV robot is a system which typically made up of vehicle chassis, embedded controller, motors, drivers, navigation and collision avoidance sensors, ...

متن کامل

A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...

متن کامل

A Threshold Accepting Algorithm for Partitioning Machines in a Tandem Automated Guided Vehicle

Abstract : A tandem automated guided vehicle (AGV) system deals with grouping workstations into some non-overlapping zones , and assigning exactly one AGV to each zone. This paper presents a new non-linear integer mathematical model to group n machines into N loops that minimizes both inter and intra-loop flows simultaneously. Due to computational difficulties of exact methods in solving our pr...

متن کامل

Scheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow

This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009